Termination w.r.t. Q proof of TRS/SK902.32.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

not(x) → if(x, false, true)
and(x, y) → if(x, y, false)
or(x, y) → if(x, true, y)
implies(x, y) → if(x, y, true)
=(x, x) → true
=(x, y) → if(x, y, not(y))
if(true, x, y) → x
if(false, x, y) → y
if(x, x, if(x, false, true)) → true
=(x, y) → if(x, y, if(y, false, true))

Q is empty.

↳ QTRS

  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

not(x) → if(x, false, true)
and(x, y) → if(x, y, false)
or(x, y) → if(x, true, y)
implies(x, y) → if(x, y, true)
=(x, x) → true
=(x, y) → if(x, y, not(y))
if(true, x, y) → x
if(false, x, y) → y
if(x, x, if(x, false, true)) → true
=(x, y) → if(x, y, if(y, false, true))

Q is empty.

We use [23] with the following order to prove termination.

Recursive path order with status [2].
Quasi-Precedence:

and₂ > [not₁, false, =_2] > [if₃, true]
or₂ > [if₃, true]
implies₂ > [if₃, true]

Status:

true: multiset
and₂: multiset
if₃: [3,1,2]
false: multiset
implies₂: [1,2]
or₂: [2,1]
=₂: [2,1]
not₁: [1]